Minimal vertex separators and new characterizations for dually chordal graphs
نویسندگان
چکیده
Many works related to dually chordal graphs, their cliques and neighborhoods were published. We will undertake a similar study but by considering minimal separators and their properties. Moreover we find new characterizations of dually chordal graphs.
منابع مشابه
On minimal vertex separators of dually chordal graphs: Properties and characterizations
Many works related to dually chordal graphs, their cliques and neighborhoods were published [1, 6]. We will undertake a similar study by considering minimal vertex separators and their properties instead. We find a necessary and sufficient condition for every minimal vertex separator to be contained in the closed neighborhood of a vertex and two major characterizations of dually chordal graphs ...
متن کاملNew results on ptolemaic graphs
In this paper, we analyze ptolemaic graphs for its properties as chordal graphs. Firstly, two characterizations of ptolemaic graphs are proved. The first one is based on the reduced clique graph, a structure that was defined by Habib and Stacho [8]. In the second one, we simplify the characterization presented by Uehara and Uno [13] with a new proof. Then, known subclasses of ptolemaic graphs a...
متن کاملGraphs with complete minimal k-vertex separators
G. A. Dirac characterized chordal graphs as those in which minimal vertex separators always induce complete subgraphs. I generalize a traditional (2-)vertex separator to a k-vertex separator — meaning a set S of vertices whose removal puts k independent vertices into k separate components. Generalizing Dirac’s theorem, the {P5, 2P3}-free chordal graphs are the graphs in which minimal k-separato...
متن کاملA new characterization of unichord-free graphs
Unichord-free graphs are defined as having no cycle with a unique chord. They have appeared in several papers recently and are also characterized by minimal separators always inducing edgeless subgraphs (in contrast to characterizing chordal graphs by minimal separators always inducing complete subgraphs). A new characterization of unichord-free graphs corresponds to a suitable reformulation of...
متن کاملCharacterization by forbidden induced subgraphs of some subclasses of chordal graphs
Chordal graphs are the graphs in which every cycle of length at least four has a chord. A set S is a vertex separator for vertices a and b if the removal of S of the graph separates a and b into distinct connected components. A graph G is chordal if and only if every minimal vertex separator is a clique. We study subclasses of chordal graphs defined by restrictions imposed on the intersections ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 35 شماره
صفحات -
تاریخ انتشار 2009